Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
نویسندگان
چکیده
We consider the incorporation of a time-consistent coherent risk measure into a multi-stage stochastic programming model, so that the model can be solved using a SDDP-type algorithm. We describe the implementation of this algorithm, and study the solutions it gives for an application of hydro-thermal scheduling in the New Zealand electricity system. The performance of policies using this risk measure at di¤erent levels of risk aversion is compared with the risk-neutral policy.
منابع مشابه
Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs
We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse functions. This formula can be used to obtain an efficient implementation of Stochastic Dual Dynamic Programming applied to convex nonlinear problems. We prove the al...
متن کاملStochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic programming problems can be solved with a reasonable accuracy by Monte Carlo sampling techniques while there are indications that complexity of multistage programs grows fast with increase of the number of stages. We ...
متن کاملOn Risk Measures in Stochastic Programs
The paper considers modeling of risk-averse preferences in (multi-stage) stochastic programming problems using risk measures. We utilize the axiomatic foundation of coherent risk measures and deviation measures in order to develop simple representations for these measures that facilitate their incorporation into stochastic programs. It is demonstrated that the developed representations allow fo...
متن کاملA Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملBounds on risk-averse mixed-integer multi-stage stochastic programming problems with mean-CVaR
Risk-averse mixed-integer multi-stage stochastic programming forms a class of extremely challenging problems since the problem size grows exponentially with the number of stages, the problem is non-convex due to integrality restrictions and the objective function is a dynamic measure of risk. For this reason, we propose a scenario tree decomposition approach, namely group subproblem approach, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 218 شماره
صفحات -
تاریخ انتشار 2012